Quantum analogue computing.
نویسندگان
چکیده
We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.
منابع مشابه
A New Model Representation for Road Mapping in Emerging Sciences: A Case Study on Roadmap of Quantum Computing
One of the solutions for organizations to succeed in highly competitive markets is to move toward emerging sciences. These areas provide many opportunities, but, if organizations do not meet requirements of emerging sciences, they may fail and eventually, may enter a crisis. In this matter, one of the important requirements is to develop suitable roadmaps in variety fields such as strategic, ca...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملAnalogue Quantum Computers for Data Analysis
Analogue computers use continuous properties of physical system for modeling. In the paper is described possibility of modeling by analogue quantum computers for some model of data analysis. It is analogue associative memory and a formal neural network. A particularity of the models is combination of continuous internal processes with discrete set of output states. The modeling of the system by...
متن کاملAnalogue Quantum Computers for Data Analysis
Analogue computers use continuous properties of physical system for modeling. In the paper is described possibility of modeling by analogue quantum computers for some model of data analysis. It is analogue associative memory and a formal neural network. A particularity of the models is combination of continuous internal processes with discrete set of output states. The modeling of the system by...
متن کاملBounds on the Power of Constant-Depth Quantum Circuits
We show that if a language is recognized within certain error bounds by constantdepth quantum circuits over a nite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC P; where EQNC is the constant-depth analogue of the class EQP. On the other hand, we adapt and extend ideas of DiVincenzo & Terhal [?] to show that, for any family F of quan...
متن کاملBounds on the Power of Constant-Depth Quantum Circuits
We show that if a language is recognized within certain error bounds by constantdepth quantum circuits over a nite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC P; where EQNC is the constant-depth analogue of the class EQP. On the other hand, we adapt and extend ideas of DiVincenzo & Terhal [?] to show that, for any family F of quan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Philosophical transactions. Series A, Mathematical, physical, and engineering sciences
دوره 368 1924 شماره
صفحات -
تاریخ انتشار 2010